Accelerating the Anti-aliased Algebraic Reconstruction Technique (ART) by . . .

نویسندگان

  • Klaus Mueller
  • Roni Yagel
  • J. Fredrick Cornhill
چکیده

Accelerating the Anti-aliased Algebraic Reconstruction Technique 2 enables us to transform ART into a backward-viewing algorithm in which voxels are projected individually onto the projection plane where their effects accumulate to form the projection image. Similarly to the PKLUT's used in [3], voxel footprints can be implemented as high-resolution 1D voxel projection tables (2D for cubic voxels), one for each projection angle ϕ, where each table entry represents the result of a linear integration of h(u,v) orthogonal to the projection plane of P ϕ. In the projection phase, for a particular projection angle ϕ, we compute for each grid voxel v j the projection Proj(v j) of v j 's center, and subsequently the extent Ext(Proj(v j)) of the voxel projection table on the projection plane. We then index the table for all pixels that fall within Ext(Proj(v j)) to obtain v j 's contribution to these pixels. Note that most of the projection calculations can be performed as incremental operations. SART's grid update equation [1] can then be implemented as follows: We associate two buffers with the projection plane: buffer B r accumulating ray sum and buffer B w accumulating the weights as voxels are projected. Buffer B o is the aquired projection image. After all voxels have been processed , the correction image buffer B c is computed as: where λ, 0<λ≤1.0 is a relaxation factor [1]. In the reprojection phase, the correction buffer B c is distributed back onto the reconstruction grid. As in the projection phase, for each voxel v j we compute Proj(v j) and Ext(Proj(v j)). The correction term for v j is then computed as the weighted sum of all correction terms affecting v j : where I is the set of elements of buffer B c for which Ext(Proj(v j)) is the corresponding set of projection pixels. This value is then added to v j. Our discussion so far was limited to the parallel beam case, however, our approach is easily extended to fan-and cone beam data with one modification: One has to scale each voxel footprint according to the perspective distortion. P 0 P 4 5 u v h(u,v) v j v k x y Proj(v j) Ext(Proj(v j)) Fig. 1. Voxels v j and v k leave identical, though spatially offset, footprints on projection planes P 0 and P 45. In P 45 , the composite footprint is depicted as …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anti-Aliased 3D Cone-Beam Reconstruction of Low-Contrast Objects with Algebraic Methods

This paper examines the use of the Algebraic Reconstruction Technique (ART) and related techniques to reconstruct 3D objects from a relatively sparse set of cone-beam projections. Although ART has been widely used for cone-beam reconstruction of high-contrast objects, e.g. in computed angiography, the work presented here explores the more challenging low-contrast case which represents a little ...

متن کامل

Variable Weighted Ordered Subset Image Reconstruction Algorithm

We propose two variable weighted iterative reconstruction algorithms (VW-ART and VW-OS-SART) to improve the algebraic reconstruction technique (ART) and simultaneous algebraic reconstruction technique (SART) and establish their convergence. In the two algorithms, the weighting varies with the geometrical direction of the ray. Experimental results with both numerical simulation and real CT data ...

متن کامل

Adaptive algebraic reconstruction technique.

Algebraic reconstruction techniques (ART) are iterative procedures for reconstructing objects from their projections. It is proven that ART can be computationally efficient by carefully arranging the order in which the collected data are accessed during the reconstruction procedure and adaptively adjusting the relaxation parameters. In this paper, an adaptive algebraic reconstruction technique ...

متن کامل

Convergence of ART in Few Projections

Algebraic Reconstruction Technique (ART) is an iterative algorithm to obtain reconstruction from projections in a finite number of iterations. The present paper discuses the convergence achieved in small number of iteration even when projection data is available in only four directions. Keywords-ART, Image Reconstruction, Convergence, Projections, Computed Tomography

متن کامل

Reconstruction with Parallel Projections using ART

Algebraic Reconstruction Technique (ART) is most accurate method for image reconstruction. In present paper the accuracy of ART is shown with parallel projections, in all only 16 projections with about 60 iterations are used to obtain reconstruction. Reference R. Gordon et al., “Three-Dimensional Reconstruction from Projections: A Review of Algorithms”, International Review of Cytology, Vol. 38...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995